An Epistemic Perspective on Consistency of Concurrent Computations

Consistency properties of concurrent computations, e.g., sequential consistency, linearizability, or eventual consistency, are essential for devising correct concurrent algorithms. In this paper, we present a logical formalization of such consistency properties that is based on a standard logic of knowledge. Our formalization provides a declarative perspective on what is imposed by consistency requirements and provides some interesting unifying insight on differently looking properties

Using Flow Specifications of Parameterized Cache Coherence Protocols for Verifying Deadlock Freedom

We consider the problem of verifying deadlock freedom for symmetric cache coherence protocols. In particular, we focus on a specific form of deadlock which is useful for the cache coherence protocol domain and consistent with the internal definition of deadlock in the Murphi model checker: we refer to this deadlock as a system- wide deadlock (s-deadlock). In s-deadlock, the entire system gets blocked and is unable to make any transition. Cache coherence protocols consist of N symmetric cache agents, where N is an unbounded parameter; thus the verification of s-deadlock freedom is naturally a parameterized verification problem. Parametrized verification techniques work by using sound abstractions to reduce the unbounded model to a bounded model. Efficient abstractions which work well for industrial scale protocols typically bound the model by replacing the state of most of the agents by an abstract environment, while keeping just one or two agents as is. However, leveraging such efficient abstractions becomes a challenge for s-deadlock: a violation of s-deadlock is a state in which the transitions of all of the unbounded number of agents cannot occur and so a simple abstraction like the one above will not preserve this violation. In this work we address this challenge by presenting a technique which leverages high-level information about the protocols, in the form of message sequence dia- grams referred to as flows, for constructing invariants that are collectively stronger than s-deadlock. Efficient abstractions can be constructed to verify these invariants. We successfully verify the German and Flash protocols using our technique

Fish and Invertebrate Use of Restored vs. Natural Oyster Reefs in a Shallow Temperate Latitude Estuary

Coastal marine habitats continue to be degraded, thereby compelling largescale restoration in many parts of the world. Whether restored habitats function similarly to natural habitats and fully recover lost ecosystem services is unclear. In estuaries, oyster reefs have been degraded by multiple anthropogenic activities including destructive fishing practices and reduced water quality, motivating restoration to maintain oyster fisheries and other ecosystem services, often at relatively high cost. We compared fish and invertebrate communities on recently restored (0–1 year post-restoration), older restored (3–4 years post-restoration), and natural oyster reefs to determine if and when restored reefs support functionally similar faunal communities. To test the influence of landscape setting on the faunal communities, the restored and natural reefs, as well as a control without reef present, were distributed among three landscapes (on the edge of salt marsh away from seagrass [salt marsh landscape], on mudflats [mudflat landscape], and near to seagrass and salt marsh [seagrass landscape]). Oyster density and biomass were greatest on restored reef habitat, as were those of non-oyster bivalve species. Total abundance of invertebrates was much greater on oyster reefs than in control plots, regardless of reef or landscape type, yet were frequently highest on older restored reefs. Meanwhile, juvenile fish densities were greatest on natural reefs, at intermediate densities on older restored reefs, and least abundant on controls. When comparing the effects of reef age and landscape setting, juvenile fish densities were greatest on younger reefs within the mudflat landscape. Collectively, these results indicate that oyster reefs harbor higher densities of resident invertebrate prey, which may explain why reef habitat is also important for juvenile fish. Laboratory and field experiments supported the notion that gag grouper (a predatory demersal fish) forage more effectively on oyster reefs than on unstructured mud bottom, whereas our experiments suggest that flounders that utilize oyster reefs likely forage on adjacent mud bottom. Because landscape setting influenced fish and invertebrate communities on restored reefs, the ecological consequences of landscape setting should be incorporated into restoration decision making and site selection to enhance the recovery of ecosystem goods and services

Fish and invertebrate use of restored vs. natural oyster reefs in a shallow temperate latitude estuary

Coastal marine habitats continue to be degraded, thereby compelling large-scale restoration in many parts of the world. Whether restored habitats function similarly to natural habitats and fully recover lost ecosystem services is unclear. In estuaries, oyster reefs have been degraded by multiple anthropogenic activities including destructive fishing practices and reduced water quality, motivating restoration to maintain oyster fisheries and other ecosystem services, often at relatively high cost. We compared fish and invertebrate communities on recently restored (0–1 year post-restoration), older restored (3–4 years post-restoration), and natural oyster reefs to determine if and when restored reefs support functionally similar faunal communities. To test the influence of landscape setting on the faunal communities, the restored and natural reefs, as well as a control without reef present, were distributed among three landscapes (on the edge of salt marsh away from seagrass [salt marsh landscape], on mudflats [mudflat landscape], and near to seagrass and salt marsh [seagrass landscape]). Oyster density and biomass were greatest on restored reef habitat, as were those of non-oyster bivalve species. Total abundance of invertebrates was much greater on oyster reefs than in control plots, regardless of reef or landscape type, yet were frequently highest on older restored reefs. Meanwhile, juvenile fish densities were greatest on natural reefs, at intermediate densities on older restored reefs, and least abundant on controls. When comparing the effects of reef age and landscape setting, juvenile fish densities were greatest on younger reefs within the mudflat landscape. Collectively, these results indicate that oyster reefs harbor higher densities of resident invertebrate prey, which may explain why reef habitat is also important for juvenile fish. Laboratory and field experiments supported the notion that gag grouper (a predatory demersal fish) forage more effectively on oyster reefs than on unstructured mud bottom, whereas our experiments suggest that flounders that utilize oyster reefs likely forage on adjacent mud bottom. Because landscape setting influenced fish and invertebrate communities on restored reefs, the ecological consequences of landscape setting should be incorporated into restoration decision making and site selection to enhance the recovery of ecosystem goods and services

Networks of Processes with . . .

In general, the verification of parameterized networks is undecidable. In recent years there has been a lot of research to identify subclasses of parameterized systems for which certain properties are decidable. Some of the results are based on nite abstractions of the parameterized system in order to use model-checking techniques to establish those properties. In a previous paper we presented a method which allows to compute abstractions of a parameterized system modeled in the decidable logic WS1S. These WS1S systems provide an intuitive way to describe parameterized systems of finite state processes. In practice however, the processes in the network themselves are infinite because of unbounded data structures. One source of unboundedness can be the usage of a parameterized data structure. Another typical source may be the presence of structures ranging over subsets of participating processes. E.g., this is the case for group membership or distributed shared memory consistency protocols. In this paper we use deductive methods to deal with such networks where the data structure is parameterized by the number of processes and an extra parameter. We show how to derive an abstract WS1S system which can be subject to algorithmic veri cation. For illustration of the method we verify the correctness of a distributed shared memory consistency protocol using PVS for the deductive verification part and the tools pax and SMV for the algorithmic part

Incremental Verification by Abstraction

We present a methodology for constructing abstractions and refining them by analyzing counter-examples. We also present a uniform verification method that combines abstraction, model-checking and deductive verification in a novel way. In particular, it allows and shows how to use the set of reachable states of the abstract system in a deductive proof even when the abstract model does not satisfy the specification and when it simulates the concrete system with respect to a weaker simulation notion than Milner's